Strategy Extraction in Reachability Games
نویسندگان
چکیده
Game tree Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification Abstract Game tree verificationGame tree verification
منابع مشابه
SAT-Based Strategy Extraction in Reachability Games
Reachability games are a useful formalism for the synthesis of reactive systems. Solving a reachability game involves (1) determining the winning player and (2) computing a winning strategy that determines the winning player’s action in each state of the game. Recently, a new family of game solvers has been proposed, which rely on counterexample-guided search to compute winning sequences of act...
متن کاملStrategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective: “stay forever in a set F of states”, and its dual, the reachability objective, “reach a set R of states”. We present in this paper a strategy improve...
متن کاملReachability-Time Games on Timed Automata
In a reachability-time game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachability-time games on strongly non-Zeno timed automata using a value iteration algorithm. This paper complements their work by providing a strategy improvement algorithm for the problem. I...
متن کاملStrategy Improvement for Concurrent Reachability and Safety Games
We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of t...
متن کاملWeak Determinacy and Decidability of Reachability Games with Partial Observation
We consider two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions. We prove that in such games, either player 1 has a strategy for winning with probability 1, or player 2 has a strategy for winning with probability 1, or both players have strategies that guarantee winning with strictly positive probability (positively winn...
متن کاملDeterminacy and Decidability of Reachability Games with Partial Observation on Both Sides
We consider two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions. We prove that in such games, either player 1 has a strategy for winning with probability 1, or player 2 has such a strategy, or both players have strategies that guarantee winning with non-zero probability (positively winning strategies). We give a fix-poin...
متن کامل